Visualising and Clustering Video Data
نویسندگان
چکیده
We review a new form of self-organizing map which is based on a nonlinear projection of latent points into data space, identical to that performed in the Generative Topographic Mapping (GTM) [1]. But whereas the GTM is an extension of a mixture of experts, this model is an extension of a product of experts [6]. We show visualisation and clustering results on a data set composed of video data of lips uttering 5 Korean vowels and show that the new mapping achieves better results than the standard Self-Organizing Map.
منابع مشابه
Video Abstraction in H.264/AVC Compressed Domain
Video abstraction allows searching, browsing and evaluating videos only by accessing the useful contents. Most of the studies are using pixel domain, which requires the decoding process and needs more time and process consuming than compressed domain video abstraction. In this paper, we present a new video abstraction method in H.264/AVC compressed domain, AVAIF. The method is based on the norm...
متن کاملClustering-based Approaches to Discovering and Visualising Microarray Data Patterns
This article focuses on clustering techniques for the analysis of microarray data and discusses contributions and applications for the implementation of intelligent diagnostic systems and therapy design studies. Approaches to validating and visualising expression clustering results and software and other relevant resources to support clustering-based analyses are reviewed. Finally, this paper a...
متن کاملVisualising Data Using Reservoir with Clustering
In this paper we illustrate a new method of visualizing and projecting time series data using reservoir computing with clustering algorithms. We show the advantages of using clustering with reservoir to visualize data. Then we extend the clustering algorithm and use a fixed latent space to preserve the topology in the projection. We illustrate the method using airport and financial time series ...
متن کاملCombining and comparing clustering and layout algorithms
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper explores a number of combinations and variants of sampling, K-means clustering and spring models in making such layouts, using Chalmers’ 1996 linear iteration time spring model as a benchmark. This algorithm runs in O(N) time overall, but the run times for the new algorithms we describe...
متن کاملKnowledge Media Institute Hierarchical clustering speed up using position lists and data position hierarchy
The aim of this paper is to address the nature of hierarchical clustering problems in systems with very large numbers of entities, and to propose specific speed improvements in the clustering algorithm. The motivation for this theme arises from the challenge of visualising the geographic and logical distribution of many tens of thousands of distance-learning students at the UK's Open University...
متن کامل